Recovering the Long-Range Links in Augmented Graphs
نویسندگان
چکیده
The augmented graph model, as introduced by Kleinberg (STOC 2000), is an appealing model for analyzing navigability in social networks. Informally, this model is defined by a pair (H,φ), where H is a graph in which inter-node distances are supposed to be easy to compute or at least easy to estimate. This graph is ”augmented” by links, called long range links, which are selected according to the probability distribution φ. The augmented graph model enables the analysis of greedy routing in augmented graphs G ∈ (H,φ). In greedy routing, each intermediate node handling a message for a target t selects among all its neighbors in G the one that is the closest to t in H and forwards the message to it. This paper addresses the problem of checking whether a given graph G is an augmented graph. It answers part of the questions raised by Kleinberg in his Problem 9 (Int. Congress of Math. 2006). More precisely, given G ∈ (H,φ), we aim at extracting the base graph H and the long range links R out of G. We prove that if H has a high clustering coefficient and bounded doubling dimension, then a simple algorithm enables to partition the edges of G into two sets H ′ and R′ such that E(H) ⊆ H ′ and the edges in H ′\E(H) are of small stretch, i.e., the map H is not perturbed too greatly by undetected long range links remaining in H ′. The perturbation is actually so small that we can prove that the expected performances of greedy routing in G using the distances in H ′ are close to the expected performances of greedy routing in (H,φ). Although this latter result may appear intuitively straightforward, since H ′ ⊇ E(H), it is not, as we also show that routing with a map more precise than H may actually damage greedy routing significantly. Finally, we show that in absence of a hypothesis regarding the high clustering coefficient, any structural attempt to extract the long range links will miss the detection of at least Ω(n/ log n) long range links of stretch at least Ω(n1/5−ε) for any 0 < ε < 1/5, and thus the map H cannot be recovered with good accuracy. To sum up, we solve Kleinberg’s Problem 9 in the sense that we show that reconstructing augmented graphs is achievable if and only if the base graph has a high clustering coefficient.
منابع مشابه
A New Perspective on the Small-World Phenomenon: Greedy Routing in Tree-Decomposed Graphs
Milgram’s experiment (1967) demonstrated that there are short chains of acquaintances between individuals, and that these chains can be discovered in a greedy manner. Kleinberg (2000) gave formal support to this so-called “small world phenomenon” by using meshes augmented with long-range links chosen randomly according to harmonic distributions. In this paper, we propose a new perspective on th...
متن کاملThe augmented Zagreb index, vertex connectivity and matching number of graphs
Let $Gamma_{n,kappa}$ be the class of all graphs with $ngeq3$ vertices and $kappageq2$ vertex connectivity. Denote by $Upsilon_{n,beta}$ the family of all connected graphs with $ngeq4$ vertices and matching number $beta$ where $2leqbetaleqlfloorfrac{n}{2}rfloor$. In the classes of graphs $Gamma_{n,kappa}$ and $Upsilon_{n,beta}$, the elements having maximum augmented Zagreb index are determined.
متن کاملSmall Worlds as Navigable Augmented Networks
The small world phenomenon, a.k.a. the six degree of separation between individuals, was identified by Stanley Milgram at the end of the 60s. Milgram experiment demonstrated that letters from arbitrary sources and bound to an arbitrary target can be transmitted along short chains of closely related individuals, based solely on some characteristics of the target (professional occupation, state o...
متن کاملHow Much Independent Should Individual Contacts Be to Form a Small-World?
We study Small–World graphs in the perspective of their use in the development of efficient as well as easy to implement network infrastructures. Our analysis starts from the Small–World model proposed by Kleinberg: a grid network augmented with directed long–range random links. The choices of the long–range links are independent from one node to another. In this setting greedy routing and some...
متن کاملEvaluation of prescribing physical activity and exercise care in recovering from Covid-19
Covid 19 disease is associated with a wide range of clinical symptoms and long-term complications. For most sports medicine professionals, it's a new challenge for people to resume their previous activities after recovering from Covid 19 after receiving the exercise prescription and care. The aim of this study was to review the appropriate physical activity for those recovering from Covid 19 in...
متن کامل